Search results for " Theoretical Computer Science"
showing 10 items of 28 documents
Finite-time stability and stabilisation for a class of nonlinear systems with time-varying delay
2014
This paper is concerned with the problems of finite-time stability FTS and finite-time stabilisation for a class of nonlinear systems with time-varying delay, which can be represented by Takagi–Sugeno fuzzy system. Some new delay-dependent FTS conditions are provided and applied to the design problem of finite-time fuzzy controllers. First, based on an integral inequality and a fuzzy Lyapunov–Krasovskii functional, a delay-dependent FTS criterion is proposed for open-loop fuzzy system by introducing some free fuzzy weighting matrices, which are less conservative than other existing ones. Then, the parallel distributed compensation controller is designed to ensure FTS of the time-delay fuzzy…
New delay-dependent stability of Markovian jump neutral stochastic systems with general unknown transition rates
2015
This paper investigates the delay-dependent stability problem for neutral Markovian jump systems with generally unknown transition rates GUTRs. In this neutral GUTR model, each transition rate is completely unknown or only its estimate value is known. Based on the study of expectations of the stochastic cross-terms containing the integral, a new stability criterion is derived in terms of linear matrix inequalities. In the mathematical derivation process, bounding stochastic cross-terms, model transformation and free-weighting matrix are not employed for less conservatism. Finally, an example is provided to demonstrate the effectiveness of the proposed results.
The colored longest common prefix array computed via sequential scans
2018
Due to the increased availability of large datasets of biological sequences, the tools for sequence comparison are now relying on efficient alignment-free approaches to a greater extent. Most of the alignment-free approaches require the computation of statistics of the sequences in the dataset. Such computations become impractical in internal memory when very large collections of long sequences are considered. In this paper, we present a new conceptual data structure, the colored longest common prefix array (cLCP), that allows to efficiently tackle several problems with an alignment-free approach. In fact, we show that such a data structure can be computed via sequential scans in semi-exter…
Measuring the clustering effect of BWT via RLE
2017
Abstract The Burrows–Wheeler Transform (BWT) is a reversible transformation on which are based several text compressors and many other tools used in Bioinformatics and Computational Biology. The BWT is not actually a compressor, but a transformation that performs a context-dependent permutation of the letters of the input text that often create runs of equal letters (clusters) longer than the ones in the original text, usually referred to as the “clustering effect” of BWT. In particular, from a combinatorial point of view, great attention has been given to the case in which the BWT produces the fewest number of clusters (cf. [5] , [16] , [21] , [23] ). In this paper we are concerned about t…
An effective extension of the applicability of alignment-free biological sequence comparison algorithms with Hadoop
2016
Alignment-free methods are one of the mainstays of biological sequence comparison, i.e., the assessment of how similar two biological sequences are to each other, a fundamental and routine task in computational biology and bioinformatics. They have gained popularity since, even on standard desktop machines, they are faster than methods based on alignments. However, with the advent of Next-Generation Sequencing Technologies, datasets whose size, i.e., number of sequences and their total length, is a challenge to the execution of alignment-free methods on those standard machines are quite common. Here, we propose the first paradigm for the computation of k-mer-based alignment-free methods for…
Retrieving Monitoring and Accounting Information from Constrained Devices in Internet-of-Things Applications
2013
Part 6: Monitoring Mechanisms; International audience; Internet-of-Things (IoT) is envisioned to provide connectivity to a vast number of sensing or actuating devices with limited computational and communication capabilities. For the organizations that manage these constrained devices, the monitoring of each device’s operational status and performance level as well as the accounting of their resource usage are of great importance. However, monitoring and accounting support is lacking in today’s IoT platforms. Hence, this paper studies the applicability of the Constrained Application Protocol (CoAP), a lightweight transfer protocol under development by IETF, for efficiently retrieving monito…
Asynchronous L1 control of delayed switched positive systems with mode-dependent average dwell time
2014
Abstract This paper investigates the stability and asynchronous L 1 control problems for a class of switched positive linear systems (SPLSs) with time-varying delays by using the mode-dependent average dwell time (MDADT) approach. By allowing the co-positive type Lyapunov–Krasovskii functional to increase during the running time of active subsystems, a new stability criterion for the underlying system with MDADT is first derived. Then, the obtained results are extended to study the issue of asynchronous L 1 control, where “asynchronous” means that the switching of the controllers has a lag with respect to that of system modes. Sufficient conditions are provided to guarantee that the resulti…
Filtering design for two-dimensional Markovian jump systems with state-delays and deficient mode information
2014
This paper is concerned with the problem of H"~ filtering for a class of two-dimensional Markovian jump linear systems described by the Fornasini-Marchesini local state-space model. The systems under consideration are subject to state-delays and deficient mode information in the Markov chain. The description of deficient mode information is comprehensive that simultaneously includes the exactly known, partially unknown and uncertain transition probabilities. By invoking the properties of the transition probability matrix, together with the convexification of uncertain domains, a new H"~ performance analysis criterion for the filtering error system is firstly derived. Then, via some matrix i…
Linear-size suffix tries
2016
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…
Towards human cell simulation
2019
The faithful reproduction and accurate prediction of the phe-notypes and emergent behaviors of complex cellular systems are among the most challenging goals in Systems Biology. Although mathematical models that describe the interactions among all biochemical processes in a cell are theoretically feasible, their simulation is generally hard because of a variety of reasons. For instance, many quantitative data (e.g., kinetic rates) are usually not available, a problem that hinders the execution of simulation algorithms as long as some parameter estimation methods are used. Though, even with a candidate parameterization, the simulation of mechanistic models could be challenging due to the extr…